|
|
Parallel Parsing
Holko, Maroš ; Regéciová, Dominika (referee) ; Meduna, Alexandr (advisor)
The goal of this bachelor thesis is to create and implement a parallel version of a Cocke-Younger-Kasami algorithm, which is used for syntactic analysis. This algorithm works with context-free grammars, so a big part of this work is dedicated to context-free grammars and their transformation to the Chomsky normal form. Output of this thesis is console application in C++ which use threads for parallel processing. There is also an extension for finding all rule successions for given input string designed and implemented. In the end there is a discussion about program's advantages and disadvantages.
|
|
|
A New Approach to LL and LR Parsing
Martiček, Štefan ; Burgetová, Ivana (referee) ; Meduna, Alexandr (advisor)
Cílem této práce je vytvořit nový efektivní způsob syntaktické analýzy propojením LL a LR přístupů. Pro demonstrační účely je zhotoven nový programovací jazyk podle vzoru programovacího jazyka PHP. Tento jazyk je rozdělen na části, kde pro každou část je použita ta nejvhodnejší ze zmíněných metod. Jednotlivé metody jsou zde podrobněji popsané v kontextu dvou typů přístupů. Jedním z nich je syntaktická analýza shora dolů a tím druhým opačná verze, syntaktická analýza zdola nahoru. Pro každou separovanou část je vytvořen samostatný syntaktický analyzátor. Táto práce poskytuje kompletní teoretický základ k sestrojení všech zde použitých syntaktických analyzátorů a rozkladových tabulek. Nakonec jsou sestrojené analyzátory společne propojeny, což je úspěšné zakončení praktické demonstrace naší metody. V závěru jsou diskutovány dosažené výsledky práce jako efektivnejší druh syntaktické analýzy, modularita přístupu a podobně. Je zde také diskutovaná použitelnost navržené metody za účelem zefektivnení vývoje a rychlosti překladu. Jako poslední jsou uvedeny náměty pro další výzkum v této oblasti.
|
|
|
Lexical Analyzer for Multiprocesor Computers
Otáhal, Jiří ; Goldefus, Filip (referee) ; Čermák, Martin (advisor)
Aim of this thesis is to invent method, which should accelerate speed of the analysis of source texts with multiprocessor computers. For this purpose application runs multiple process in Unix system. Each undergoing process analyzes exact partition in source file and then closes itself. Outcome of this process are internal structures, which presents exact partition. Inter-code is sequentially built from the structures which are subsequently interpreted. This kind of parallel analysis achieves acceleration of speed on the contrary of typical sequential analysis.
|
|
|
Parsing Based on Random Context Grammars
Mikita, Martin ; Solár, Peter (referee) ; Vrábel, Lukáš (advisor)
This thesis describes a random context grammar and the implementation of an application which will convert this grammar (respecting the LL condition) to an equivalent context-free grammar (also satisfying the LL condition). The resulting grammar can be used in the existing parser generator that accepts a yacc-compatible format. This thesis uses the GNU Bison generator, for which the encapsulated script was introduced. The potential advantage of random context grammar consists in the proven efficient description compared to context-free grammar for some languages.
|
|
|
Conversions between CF Grammars and Pushdown Automata
Makovský, Benjamin ; Goldefus, Filip (referee) ; Masopust, Tomáš (advisor)
This work suggests and solves the implementation of the transformation of context-free grammars and the conversions between context-free grammars and pushdown automata. It makes acquainted with the models used in modern theory of formal languages. In the work are indicated all algorithms necessary for transformations and mutual conversions between context-free grammars and pushdown automata. Proposed is an object representing the grammar and the automaton in the programme. Described is the assigning of definitions of grammar and of the automaton, the solution of drawing the automaton on the screen and the creation of graphical user interface of the application. The resulting programme is developed as Jawa applet which is available on public internet pages www.convertcfg.php5.cz.
|
|
|
Graphdrawer and Mathemathic Equation Evaluator of Expressions
Skalický, Ivo ; Rychnovský, Lukáš (referee) ; Lukáš, Roman (advisor)
This work deals with utilization of precedence syntax analysis for conversion of mathematical expression into dynamic object model in order of evaluate and go on processing expressions. Objective was to create a program, which connects function of scientific calculator and graph drawer. Program can evaluate mathematical expressions in scope of real numbers, calculate fractional expressions, numerically integrate and analytically derive in accordance with a given parameter. Besides it provides function for depiction of any given curve explicitly, implicitly or parametricly into 2D graph. Graphic output can be exported in selectable resolution into several basic raster and vector formats. On account of portability Java was chosen as a language of implementation.
|
|
|
Advanced Error Recovery during Top-Down Parsing
Obluková, Alena ; Kolář, Dušan (referee) ; Meduna, Alexandr (advisor)
Parser is one of the most important parts in compiler since Syntax-Directed Translation is often used. This approach means that parser controls semantic actions and generation of syntax tree. When the input contains an error, parser cannot continue and the whole compiler has to stop. Therefore, it is important to have parser with error recovery, so when error occurs parser is able to continue. There are several error-recovery strategies and methods. In this paper is described Acceptable-sets derived from continuations specifically continuation in LL parsers. However it is not so well known method it is easy to explain and to implement. It can be used in the lesson to demonstrate error recovery in top-down parser.
|
|
|
Parsing Based on Multigeneration
Kleiner, Miloš ; Čermák, Martin (referee) ; Meduna, Alexandr (advisor)
Multygeneratic system is based on cooperation action of infinity count of context-free grammars. All this context free-grammars parallel and synchronous derivate individual sentential form. During generation came in each specific derivation step to checking of correction of each generated sentential forms. This checking can be made by different ways. Solution is then so-called multistring (vector of strings), so by the help of this is defined generated language.
|
|
|
Parsing Based on Multigeneration
Kyjovská, Linda ; Přikryl, Zdeněk (referee) ; Lukáš, Roman (advisor)
This work deals with syntax analysis problems based on multi-generation. The basic idea is to create computer program, which transforms one input string to n -1 output strings. An Input of this program is some plain text file created by user, which contains n grammar rules. Just one grammar from the input file is marked as an input grammar and others n -1 grammars are output grammars. This program creates list of used input grammar rules for an input string and uses corresponding output grammar rules for the creation of n -1 output strings. The program is written in C++ and Bison
|
|
|
Parsing Based on Grammar Systems
Sedmík, Adam ; Klobučníková, Dominika (referee) ; Meduna, Alexandr (advisor)
This thesis is focused on grammar systems and syntax analysis. Thesis introduces cooperating distributed and parallel communicating grammar systems. Based on knowledge of grammar systems, new grammar system is introduced. This grammar system focuses on modularization of syntax analysis. Shown are two methods of syntax analysis, recursive descent parsing and precedence parsing. Grammar systems introduced are demonstrated on syntax analysis of custom programming language.
|
guest ::
